Maximum directed cuts in digraphs with degree restriction
نویسندگان
چکیده
منابع مشابه
Maximum directed cuts in digraphs with degree restriction
For integers m, k ≥ 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.
متن کاملMaximum directed cuts in acyclic digraphs
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs.
متن کاملMaximum Directed Cuts in Graphs with Degree Constraints
The Max Cut problem is an NP-hard problem and has been studied extensively. Alon et al. studied a directed version of the Max Cut problem and observed its connection to the Hall ratio of graphs. They proved, among others, that if an acyclic digraph has m edges and each vertex has indegree or outdegree at most 1, then it has a directed cut of size at least 2m/5. Lehel et al. extended this result...
متن کاملCovering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts
For integers k, l ≥ 0, let D(k, l) denote the family of digraphs in which every vertex has either indegree at most k or outdegree at most l. In this paper we prove that the edges of every digraph in D(3, 3) and D(4, 4) can be covered by at most five directed cuts, and present an example in D(3, 3) which shows that this result is best possible.
متن کاملImage Segmentation With Maximum Cuts
This paper presents an alternative approach to the image segmentation problem. Similar to other recent proposals a graph theoretic framework is used: Given an image a weighted undirected graph is constructed, where each pixel becomes a vertex of the graph and edges measure a relationship between pixels. Our approach differs from previous work in the way we define the edge weights. Typically the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2009
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.20374